Shannon graphs, subshifts and lambda-graph systems
نویسندگان
چکیده
منابع مشابه
On Lambda-graph Systems for Subshifts of Subshifts
Kengo Matsumoto has introduced λ-graph systems and strong shift equivalence of λ-graph systems [Doc.Math.4 (1999), 285-340]. We associate to a subshift of a subshift a λ-graph system. The strong shift equivalence class of the associated λ-graph system is an invariant of subsystem equivalence. Wolfgang Krieger and Kengo Matsumoto have introduced the λ-entropy of a λ-graph system and have shown i...
متن کاملTextile Systems on Lambda-graph Systems
The notions of symbolic matrix system and λ-graph system for a subshift are generalizations of symbolic matrix and λ-graph (= finite symbolic matrix) for a sofic shift respectively ([Doc. Math. 4(1999), 285-340]). M. Nasu introduced the notion of textile system for a pair of graph homomorphisms to study automorphisms and endomorphisms of topological Markov shifts ([Mem. Amer. Math. Soc. 546,114...
متن کاملA quantum Jensen-Shannon graph kernel for unattributed graphs
In this paper, we use the quantum Jensen–Shannon divergence as a means of measuring the information theoretic dissimilarity of graphs and thus develop a novel graph kernel. In quantum mechanics, the quantum Jensen–Shannon divergence can be used to measure the dissimilarity of quantum systems specified in terms of their density matrices. We commence by computing the density matrix associated wit...
متن کاملGraph Powers, Delsarte, Hoffman, Ramsey, and Shannon
The k-th p-power of a graph G is the graph on the vertex set V (G), where two k-tuples are adjacent iff the number of their coordinates which are adjacent in G is not congruent to 0 modulo p. The clique number of powers of G is poly-logarithmic in the number of vertices, thus graphs with small independence numbers in their p-powers do not contain large homogenous subsets. We provide algebraic u...
متن کاملAutomated Deduction with Shannon Graphs
Binary Decision Diagrams (BDDs) are a well-known tool for representing Boolean functions. We show how BDDs can be extended to full rst-order logic by integrating means for representing quantiiers. The resulting structures are called Shannon graphs. A calculus based on these Shannon graphs is set up, and its soundness and completeness proofs are outlined. A comparison of deduction with rst-order...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Mathematical Society of Japan
سال: 2002
ISSN: 0025-5645
DOI: 10.2969/jmsj/1191591995